A Note on the Practicality of Maximal Planar Subgraph Algorithms
نویسندگان
چکیده
Given a graph G, the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of G with the maximum number of edges. There are several heuristic, approximative, and exact algorithms to tackle the problem, but—to the best of our knowledge— they have never been compared competitively in practice. We report on an exploratory study on the relative merits of the diverse approaches, focusing on practical runtime, solution quality, and implementation complexity. Surprisingly, a seemingly only theoretically strong approximation forms the building block of the strongest choice.
منابع مشابه
Spanning Maximal Planar Subgraphs of Random Graphs
We study the threshold for the existence of a spanning maximal planar subgraph in the random graph Gn . We show that it is very near p = ~TTOWe also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near
متن کاملA note on computing a maximal planar subgraph using PQ-trees
The problem of computing a maximal planar subgraph of a non planar graph has been deeply investigated over the last 20 years. Several attempts have been tried to solve the problem with the help of P Q-trees. The latest attempt has been reported by Jayakumar et al. 10]. In this paper we show that the algorithm presented by Jayakumar et al. is not correct. We show that it does not necessarily com...
متن کاملA greedy random adaptive search procedure for the weighted maximal planar graph problem
The weighted maximal planar graph (WMPG) problem seeks to find a subgraph from a given weighted complete graph such that the subgraph is planar—it can be embedded on the plane without any arcs intersecting. The subgraph is maximal—no additional arc can be added to the subgraph without destroying its planarity and it also has the maximal sum of arc weights. In this paper, the main objective is t...
متن کاملMaximal Planar Subgraphs of Fixed Girth in Random Graphs
In 1991, Bollobás and Frieze showed that the threshold for Gn,p to contain a spanning maximal planar subgraph is very close to p = n−1/3. In this paper, we compute similar threshold ranges for Gn,p to contain a maximal bipartite planar subgraph and for Gn,p to contain a maximal planar subgraph of fixed girth g.
متن کاملA Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. Polynomial algorithms have been obtained by Jakayumar, Thulasiraman and Swamy [6] and Wu [9]. O(mlogn) algorithms were previously given by Di Battista and Tamassia [3] and Cai, Han and Tarjan [2]. A recent O(m α α (n))...
متن کامل